Disjoint dominating and 2-dominating sets in graphs
نویسندگان
چکیده
منابع مشابه
On graphs with disjoint dominating and 2-dominating sets
A DD2-pair of a graph G is a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. Although there are infinitely many graphs that do not contain a DD2-pair, we show that every graph with minimum degree at least two has a DD2-pair. We provide a constructive characterization of trees that have a DD2-pair and show that K3,3 is the only con...
متن کاملRemarks about disjoint dominating sets
We solve a number of problems posed by Hedetniemi, Hedetniemi, Laskar, Markus, and Slater concerning pairs of disjoint sets in graphs which are dominating or independent and dominating.
متن کاملA Note on Disjoint Dominating Sets in Graphs
The disjoint domination number γγ(G) of a graph G is the minimum cardinality of the union of two disjoint dominating sets in G. The disjoint independent domination number of a graph G is the minimum cardinality of the union of two disjoint independent dominating sets in G. In this paper we study these two parameters. We determine the value of γγ(G) for several graphs and give partial answers to...
متن کاملA Characterization of Graphs with Disjoint Total Dominating Sets
A set S of vertices in a graph G is a total dominating set of G if every vertex is adjacent to a vertex in S. A fundamental problem in total domination theory in graphs is to determine which graphs have two disjoint total dominating sets. In this paper, we solve this problem and provide a constructive characterization of the graphs that have two disjoint total dominating sets.
متن کاملStrength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2020
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2019.100553